Determining the Circular Flow Number of a Cubic Graph
نویسندگان
چکیده
منابع مشابه
Determining the Chromatic Number of a Graph
Certain branch-and-bound algorithms for determining the chromatic number of a graph are proved usually to take a number of steps which grows faster than exponentially with the number of vertices in the graph. A similar result holds for the number of steps in certain proofs of lower bounds for chromatic numbers. Key words, graph, chromatic number, algorithm, proof
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملThe Circular Flow Number of a 6-Edge Connected Graph is Less Than Four
We show that every 6-edge connected graph admits a circulation whose range lies in the interval 1; 3). The circular ow number c (G) of a ((nite) graph G is deened by c (G) = inffr 2 R: some orientation ~ G admits a circulation f : E(~ G) ! 1; r ? 1]g: This parameter is a reenement of the well studied ow number (G) := d c (G)e, which was introduced by Tutte as a dual to the chromatic number. Sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2021
ISSN: 1077-8926
DOI: 10.37236/9607